The two stage assembly flowshop scheduling problem to minimize total tardiness

The two-stage assembly flowshop scheduling problem is addressed with the objective of minimizing total tardiness. An insertion algorithm, a genetic algorithm, and a hybrid of the insertion and genetic algorithms, are developed for the problem. Conducted computational experiments reveal that the hybrid algorithm significantly outperforms the genetic algorithm while the best performing algorithm is the insertion algorithm. Moreover, the performance of the insertion algorithm remains as the best regardless of the tightness of due dates of the jobs. Key-Words: Scheduling, assembly flowshop, total tardiness, algorithm, genetic, insertion